Distance-Sensitive Property Testing Lower Bounds
نویسندگان
چکیده
In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter ǫ. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone and testing whether the function has low Fourier degree. For monotonicity testing, our lower bound matches the recent upper bound of Chakrabarty and Seshadhri [12].
منابع مشابه
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input domain. We consider distribution-free testing of several basic Boolean function classes over {0, 1}, namely monotone conjunctions, general conjunctions, decision lists, and linear threshold functions. We prove that for eac...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 9 : Lower Bounds in Property Testing ∗
We first give a brief introduction to the field of property testing. Section 3 gives upper bounds for the canonical property of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. We won’t need to develop any new communication complexity; our existing toolbox (specifically, Disjointness) is already rich enough to de...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗
We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communicati...
متن کاملThe Information Complexity of Hamming Distance
The Hamming distance function Hamn,d returns 1 on all pairs of inputs x and y that differ in at most d coordinates and returns 0 otherwise. We initiate the study of the information complexity of the Hamming distance function. We give a new optimal lower bound for the information complexity of the Hamn,d function in the small-error regime where the protocol is required to err with probability at...
متن کاملImproved bounds for testing Dyck languages
In this paper we consider the problem of deciding membership in Dyck languages, a fundamental family of context-free languages, comprised of well-balanced strings of parentheses. In this problem we are given a string of length n in the alphabet of parentheses of m types and must decide if it is well-balanced. We consider this problem in the property testing setting, where one would like to make...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013